Construction of pseudorandom binary lattices using elliptic curves
نویسنده
چکیده
In an earlier paper Hubert, Mauduit and Sárközy introduced and studied the notion of pseudorandomness of binary lattices. Later constructions were given by using characters and the notion of multiplicative inverse over finite fields. In this paper a further large family of pseudormandom binary lattices is constructed by using elliptic curves. 2000 Mathematics Subject Classification: Primary 11K45
منابع مشابه
Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
In this paper the randomness of binary sequences generated over elliptic curve is studied. The construction uses multiplicative characters and both the well-distribution and correlation measures are estimated. 2000 Mathematics Subject Classification: Primary 11K45
متن کاملElliptic curve analogues of a pseudorandom generator
Using the discrete logarithm in [7] and [9] a large family of pseudorandom binary sequences was constructed. Here we extend this construction. An interesting feature of this extension is that in certain special cases we get sequences involving points on elliptic curves. 2000 AMS Mathematics Subject Classification: 11K45. List of keywords and phrases: pseudorandom, elliptic curve.
متن کاملConstruction of large families of pseudo-random binary sequences
In a series of papers Mauduit and S arkozy (partly with coauthors) studied nite pseudorandom binary sequences. They showed that the Legendre symbol forms a \good" pseudorandom sequence, and they also tested other sequences for pseudorandomness, however, no large family of \good" pseudorandom sequences has been found yet. In this paper, a large family of this type is constructed. Again, the con...
متن کاملConstruction of large families of pseudorandom subsets using elliptic curves
Recently, Dartyge and Sárközy investigated the measures, i.e., the well distribution measure and the correlation measure of order k, of pseudorandomness of subsets of the set {1, 2, . . . ,N}, and they presented several constructive examples for subsets with strong pseudorandom properties when N is a prime number. In this article, we present a construction of pseudorandom subsets using elliptic...
متن کاملConstruction of pseudorandom binary lattices based on multiplicative characters
In this paper a large family of pseudorandom binary lattices is constructed by using the multiplicative characters of finite fields. This construction generalizes several one dimensional constructions to arbitrary dimension. 2000 Mathematics Subject Classification: Primary 11K45
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010